Some refinements of the Deligne–Illusie theorem

نویسندگان

چکیده

We extend the results of Deligne and Illusie on liftings modulo $p^2$ decompositions de Rham complex in several ways. show that for a smooth scheme $X$ over perfect field $k$ characteristic $p>0$, truncations $\max(p-1, 2)$ consecutive degrees can be reconstructed as objects derived category terms its truncation at most one (or, equivalently, obstruction class to lifting $p^2$). Consequently, these are decomposable if admits $W_2(k)$, which case first nonzero differential conjugate spectral sequence appears no earlier than page $\max(p,3)$ (these corollaries have been recently strengthened by Drinfeld, Bhatt-Lurie, Li-Mondal). Without assuming existence lifting, we describe gerbes splittings two-term differentials second sequence, answering question Katz. The main technical result used $p>2$ belongs purely homological algebra. It concerns certain commutative graded algebras whose cohomology algebra is exterior algebra, dubbed us "abstract Koszul complexes", $p$ an example. In appendix, use aforementioned stronger decomposition prove Kodaira-Akizuki-Nakano vanishing Hodge-de degeneration both hold $F$-split $(p+1)$-folds.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some refinements of the almost stability theorem

Let G be a group, let T be an (oriented) G-tree with finite edge stabilizers, and let V T denote the vertex set of T . We show that, for each G-retract V ′ of the G-set V T , there exists a G-tree whose edge stabilizers are finite and whose vertex set is V ′. This fact leads to various new consequences of the almost stability theorem. We also give an example of a group G, a G-tree T and a G-ret...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

Refinements of Some Partition Inequalities

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if M 5 is an integer and the integers a and b are relatively prime to M and satisfy 1  a < b < M/2, and the c(m,n) are defined by 1 (sqa, sqM a; qM )1 1 (sqb, sqM b; qM )1 := X

متن کامل

Refinements of Gál’s Theorem and Applications

We give a simple proof of a well-known theorem of Gál and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in Gál’s theorem, which is new. Our approach also gives a transparent explanation of the relationship between the maximal size of the Riemann zeta function on vertical lines and b...

متن کامل

Some Design Refinements and Principles on the

This paper describes some design refinements on marking menus and shows how these refinements embody interesting and relevant design principles for HCI. These refinements are based on the design principles of: (1) maintaining visual context, (2) hiding unnecessary information, and (3) supporting skill development by graphical feedback. The result is a new graphical representation and a more eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra & Number Theory

سال: 2023

ISSN: ['1944-7833', '1937-0652']

DOI: https://doi.org/10.2140/ant.2023.17.199